Prioritised fuzzy constraint satisfaction problems: axioms, instantiation and validation
نویسندگان
چکیده
منابع مشابه
Reduction operations in fuzzy or valued constraint satisfaction
In the constraint satisfaction problem (CSP) knowledge about a relation on n variables is given in the form of constraints on subsets of the variables. A solution to the CSP is simply an instantiation of the n variables which satis.es all the constraints. The fuzzy constraint satisfaction problem (FCSP) is a generalisation of the CSP to the case in which the constraints are not categorical but ...
متن کاملDistributed Constraint Satisfaction through Constraint Partition and Coordinated Reaction
We present a methodology, called Constraint Partition and Coordinated Reaction (CP&CR), for distributed constraint satisfaction based on partitioning the set of constraints into subsets of different constraint types. Associated with each constraint type is a set of specialized agents, each of which is responsible for enforcing constraints of the specified type for the set of variables under its...
متن کاملEmergent Constraint Satisfaction Through Multi-Agent Coordinated Interaction
We present a methodology, called Constraint Partition and Coordinated Reaction (CP&CR), for distributed constraint satisfaction based on partitioning the set of constraints into subsets of di erent constraint types. Associated with each constraint type is a set of specialized agents, each of which is responsible for enforcing constraints of the speci ed type for the set of variables under its j...
متن کاملAn algorithm for solving constraint-satisfaction problems
We introduce a new method, called constraint-directed-generate-and-test (CDGT), for solving constraint satisfaction problems (CSPs). Instead of appending a new instantiation of one variable to a partial solution, as in traditional search methods, CDGT joins two sets of partial solutions and then checks against other relevant constraints to obtain a set of higher order partial solutions. CDGT is...
متن کاملWeight-based Heuristics for Constraint Satisfaction and Combinatorial Optimization Problems
In this paper, we propose mechanisms to improve instantiation heuristics by incorporating weighted factors on variables. The proposed weight-based heuristics are evaluated on several tree search methods such as chronological backtracking and discrepancy-based search for both constraint satisfaction and optimization problems. Experiments are carried out on random constraint satisfaction problems...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Fuzzy Sets and Systems
دوره 136 شماره
صفحات -
تاریخ انتشار 2003